Finite Unions for Ada 95
نویسندگان
چکیده
In a recent project the Ada language turned out to be not as flexible as we expected it to be. This forced us to model our application in a way that was less elegant, less maintainable and less efficient. In this paper we propose to add a language construct to the language that would enable us to do what we were missing. The extension is based on finite unions with dispatching and can quite easily be integrated into the language and efficiently implemented.
منابع مشابه
Testing Ada 95 Object-Oriented Programs
We show some of the specific problems for testing software introduced by the object-oriented features of Ada 95, and focus on specificationbased testing, since this strategy is the key strategy for testing object-oriented software. We present a theory for testing software by refinement of an exhaustive test set into a finite test set using three reduction hypothesis. We also show how the Oracle...
متن کاملFinite unions of submodules ON FINITE UNIONS OF SUBMODULES
This paper is concerned with finite unions of ideals and modules. The first main result is that if N ⊆ N1 ∪N2 ∪ · · · ∪Ns is a covering of a module N by submodules Ni, such that all but two of the Ni are intersections of strongly irreducible modules, then N ⊆ Nk for some k. The special case when N is a multiplication module is considered. The second main result generalizes earlier results on co...
متن کاملA Catalog for Prediction-Preserving Reducibility with Membership Queries on Formal Languages
This paper presents several results of prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages. We mainly deal with two kinds of concept classes, simple CFGs and finite unions of regular pattern languages. For the former, we show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, on t...
متن کاملTasking Deadlocks in Ada 95 Programs and Their Detection
Tasking deadlock is one of the most serious and complex problems concerning the reliability of concurrent systems with Ada. In this paper, tasking deadlocks which may occur in Ada 95 programs are investigated, a representation, named the Task-Wait-For Graph, for task synchronization waiting state of an Ada 95 program is proposed, and a runtime detection method for the tasking deadlocks based on...
متن کاملSchubert unions in Grassmann varieties
We study subsets of Grassmann varieties G(l, m) over a field F , such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study the linear spans of, and in case of positive characteristic, the number of Fq-rational points on such unions. Moreover we study a geometric duality of such unions, and give a combinatorial interpretation of this duality. We discuss the ma...
متن کامل